Accelerating the Best Trail Search on AES-Like Ciphers
نویسندگان
چکیده
In this study, we accelerate Matsui’s search algorithm to for the best differential and linear trails of AES-like ciphers. Our acceleration points are twofold. The first exploits structure branch number an round function apply strict pruning conditions algorithm. second employs permutation characteristics in trail reduce inputs that need be analyzed. We demonstrate optimization by obtaining existing block ciphers: AES, LED, MIDORI-64, CRAFT, SKINNY, PRESENT, GIFT. particular, our program finds fullround GIFT-64 (in approx. 1 s 10 s) GIFT-128 89 h 452 h), respectively.For a more in-depth application, leverage investigate optimal DC/LC resistance GIFT-variants, called BOGI-based ciphers, can achieve. To end, identify all ciphers them into 41,472 representatives. Deriving 16-, 32-, 64-, 128-bit from representatives, obtain their until 15, 13, 11 rounds, respectively. investigation shows 12 rounds minimum threshold 64-bit BOGIbased cipher prevent efficient DC/LC, whereas requires 14 rounds. Moreover, it is shown GIFT provide better only replacing bit permutation. Specifically, variants require fewer one two, respectively, trails.
منابع مشابه
New Insights on AES-Like SPN Ciphers
It has been proved in Eurocrypt 2016 by Sun et al. that if the details of the S-boxes are not exploited, an impossible differential and a zero-correlation linear hull can extend over at most 4 rounds of the AES. This paper concentrates on distinguishing properties of AES-like SPN ciphers by investigating the details of both the underlying S-boxes and the MDS matrices, and illustrates some new i...
متن کاملDifferential Trail Weights in AES-like Ciphers Using New Permutation Layers
Differential cryptanalysis is about finding trails which involve a low amount of active S-box operations. Such patterns simplify the difference propagation and thus the computations of the secret round keys. The weight of a trail expresses the total number of non-zero Sbox input differences within the cipher for a certain execution and is highly dependent on the specified permutation layers. Th...
متن کاملLooting the LUTs : FPGA Optimization of AES and AES-like Ciphers for Authenticated Encryption
In this paper, we investigate the efficiency of FPGA implementations of AES and AES-like ciphers, specially in the context of authenticated encryption. We consider the encryption/decryption and the authentication/verification structures of OCB-like modes (like OTR or SCT modes). Their main advantage is that they are fully parallelisable. While this feature has already been used to increase the ...
متن کاملAnalyzing Permutations for AES-like Ciphers: Understanding ShiftRows
Designing block ciphers and hash functions in a manner that resemble the AES in many aspects has been very popular since Rijndael was adopted as the Advanced Encryption Standard. However, in sharp contrast to the MixColumns operation, the security implications of the way the state is permuted by the operation resembling ShiftRows has never been studied in depth. Here, we provide the first struc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IACR transaction on symmetric cryptology
سال: 2022
ISSN: ['2519-173X']
DOI: https://doi.org/10.46586/tosc.v2022.i2.201-252